package Wuli_2023;

public class find_schema_2023 {
    public static void main(String[] args) {
        System.out.println(find(1));
    }

    public static int find(int n) {
        if (n == 1 || n == 0)
            return 1;
        return find(n - 1) + find(n - 2);
    }

    public static int find2(int n) {
        //初始化第0天和第1天
        int x_1 = 1, x_2 = 1, x_n = 1; //第n天的方案数等于第n-1加n-2天
        for(int i=2;i<=n;i++){
            x_n=x_1+x_2;
            x_2=x_1;
            x_1=x_n;
        }
        return x_n;
    }
}
